Isogeny volcanoes
نویسنده
چکیده
The remarkable structure and computationally explicit form of isogeny graphs of elliptic curves over a finite field has made them an important tool for computational number theorists and practitioners of elliptic curve cryptography. This expository paper recounts the theory behind these graphs and examines several recently developed algorithms that realize substantial (often dramatic) performance gains by exploiting this theory.
منابع مشابه
Computing isogeny volcanoes of composite degree
Isogeny volcanoes are an interesting structure that have had several recent applications. An isogeny volcano is a connected component of a larger graph called a cordillera. In this paper, we further explore properties of how to compute volcanoes given that we have already computed one of a different degree. This allows us to compute volcanoes of composite degree more efficiently than a direct c...
متن کاملPairing the Volcano
Isogeny volcanoes are graphs whose vertices are elliptic curves and whose edges are `-isogenies. Algorithms allowing to travel on these graphs were developed by Kohel in his thesis (1996) and later on, by Fouquet and Morain (2001). However, up to now, no method was known, to predict, before taking a step on the volcano, the direction of this step. Hence, in Kohel's and Fouquet-Morain algorithms...
متن کاملOn Avoiding ZVP-Attacks Using Isogeny Volcanoes
The usage of elliptic curve cryptography in smart cards has been shown to be efficient although, when considering curves, one should take care about their vulnerability against the Zero-Value Point Attacks (ZVP). In this paper, we present a new procedure to find elliptic curves which are resistant against these attacks. This algorithm finds, in an efficient way, a secure curve by means of volca...
متن کاملIsogeny cordillera algorithm to obtain cryptographically good elliptic curves
The security of most elliptic curve cryptosystems is based on the intractability of the Elliptic Curve Discrete Logarithm Problem (ECDLP). Such a problem turns out to be computationally unfeasible when elliptic curves are suitably chosen. This paper provides an algorithm to obtain cryptographically good elliptic curves from a given one. The core of such a procedure lies on the usage of successi...
متن کاملModular polynomials via isogeny volcanoes
We present a new algorithm to compute the classical modular polynomial Φl in the rings Z[X,Y ] and (Z/mZ)[X, Y ], for a prime l and any positive integer m. Our approach uses the graph of l-isogenies to efficiently compute Φl mod p for many primes p of a suitable form, and then applies the Chinese Remainder Theorem (CRT). Under the Generalized Riemann Hypothesis (GRH), we achieve an expected run...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1208.5370 شماره
صفحات -
تاریخ انتشار 2012